Near-Optimal Graph Signal Sampling by Pareto Optimization
نویسندگان
چکیده
منابع مشابه
Adaptive Graph Signal Processing: Algorithms and Optimal Sampling Strategies
The goal of this paper is to propose novel strategies for adaptive learning of signals defined over graphs, which are observed over a (randomly time-varying) subset of vertices. We recast two classical adaptive algorithms in the graph signal processing framework, namely, the least mean squares (LMS) and the recursive least squares (RLS) adaptive estimation strategies. For both methods, a detail...
متن کاملUse of Pareto-Optimal and Near Pareto-Optimal Candidate Rules in Genetic Fuzzy Rule Selection
Genetic fuzzy rule selection is an effective approach to the design of accurate and interpretable fuzzy rule-based classifiers. It tries to minimize the complexity of fuzzy rule-based classifiers while maximizing their accuracy by selecting only a small number of fuzzy rules from a large number of candidate rules. One important issue in genetic fuzzy rule selection is the prescreening of candid...
متن کاملPareto Optimal Modeling for Efficient PLL Optimization
Simulation-based synthesis tools for analog circuits [1,2] face a problem extending their sizing/biasing methodology to larger block-level designs such as phase lock loops or converters: the time to fully evaluate (i.e., to fully simulate) each complete circuit solution candidate is prohibitive inside a numerical optimization loop. In this paper, we show how to circumvent this problem with a ca...
متن کاملSubset Selection by Pareto Optimization
Selecting the optimal subset from a large set of variables is a fundamental problem in various learning tasks such as feature selection, sparse regression, dictionary learning, etc. In this paper, we propose the POSS approach which employs evolutionary Pareto optimization to find a small-sized subset with good performance. We prove that for sparse regression, POSS is able to achieve the best-so...
متن کاملLearning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focus on repeated coordination games of non-identical interest where agents do not know the game structure up front and receive noisy payoffs. We design efficient near-optimal algorithms for both the perfect monitoring and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2021
ISSN: 1424-8220
DOI: 10.3390/s21041415